package collection.list;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class SortPoint {
    public static void main(String[] args) {
        List<Point> list = new ArrayList<>();
        list.add(new Point(3,5));
        list.add(new Point(52,7));
        list.add(new Point(1,9));
        list.add(new Point(63,14));
        list.add(new Point(4,787));
        list.add(new Point(74,56));
        System.out.println("排序前"+list);
        list.sort(new Comparator<Point>() {
            @Override
            public int compare(Point o1, Point o2) {
                return o1.getX()- o2.getX();
            }
        });
       /* Collections.sort(list, new Comparator<Point>() {
            @Override
            public int compare(Point o1, Point o2) {
                int len1 = o1.getX()* o1.getX()+o1.getY()*o1.getY();
                int len2 = o2.getX()* o2.getX()+o2.getY()*o2.getY();
                return len1 -  len2;
            }
        });*/
        System.out.println("排序后"+list);
    }
}
